منابع مشابه
A Simple Proof of a Minimum Cut Algorithm and Its Applications
For the correctness of the minimum cut algorithm proposed in [H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, 5, 1992, pp. 54–66], several simple proofs have been presented so far. This paper gives yet another simple proof. As a byproduct, it can provide an O(m log n) time algorithm that outputs a maximum flow between...
متن کاملHigher-Dimensional Segmentation by Minimum-cut Algorithm
It is important in many applications of 3D and higher dimensional segmentation that the resulting segments of voxels are not required to have only one connected component, as in some of extant methods. Indeed, it is generally necessary to be able to automatically determine the appropriate number of connected components. More generally, for a larger class of applications, the segments should hav...
متن کاملA Simple MAX-CUT Algorithm for Planar Graphs
The max-cut problem asks for partitioning the nodes V of a graph G = (V,E) into two sets (one of which might be empty), such that the sum of weights of edges joining nodes in different partitions is maximum. Whereas for general instances the max-cut problem is NPhard, it is polynomially solvable for certain classes of graphs. For planar graphs, there exist several polynomial-time methods determ...
متن کاملFast Incremental Minimum-Cut Based Algorithm for Graph Clustering
In this paper we introduce an incremental clustering algorithm for undirected graphs. The algorithm can maintain clusters efficiently in presence of insertion and deletion (updation) of edges and vertices. The algorithm produces clusters that satisfies the quality requirement, given by the bicriteria of [6]. To the best of our knowledge, this is the first clustering algorithm, for dynamic graph...
متن کاملInteractive Object Selection Using S-t Minimum Cut
In this paper, we present an interactive object selection approach that applies s − t minimum cut on local contour neighborhoods of the object boundary to segment the object from the background. Using a simple interface, users can extract accurate object contours interactively. Our approach has the following properties. 1) Interactivity: The interface is easy to use and accepts flexible freehan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00182-3